Spilne bases in digital data compression problems

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Interactive Compression of Digital Data

If we can use previous knowledge of the source (or the knowledge of a source that is correlated to the one we want to compress) to exploit the compression process then we can have significant gains in compression. By doing this in the fundamental source coding theorem we can substitute entropy with conditional entropy and we have a new theoretical limit that allows for better compression. To do...

متن کامل

Scattered Data Coding in Digital Image Compression

This paper concerns digital image compression using adaptive thinning algorithms. Adaptive thinning is a recursive point removal scheme which works with decremental Delaunay triangulations. When applied to digital images, adaptive thinning returns a scattered set of most significant pixels. This requires efficient and customized methods for coding these pixels (but not their connectivities). To...

متن کامل

Harmonic Analysis of Digital Data Bases

Digital databases can be represented by matrices, where rows (say) correspond to numerical sensors readings, or features, and columns correspond to data points. Recent data analysis methods describe the local geometry of the data points using a weighted affinity graph, whose vertices correspond to data points. We consider two geometries, or graphs one on the rows and one on the columns, such th...

متن کامل

P-complete Problems in Data Compression

De Agostino, S., P-complete problems in data compression, Theoretical Computer Science 127 (1994) 181-186. In this paper we study the parallel computational complexity of some methods for compressing data via textual substitution. We show that the Ziv-Lempel algorithm and two standard variations are P-complete. Hence an efficient parallelization of these algorithms is not possible uqless P = NC.

متن کامل

Some Problems Of Linguistic Data Bases

The l o g i c a l p a r t d e t e r m i n e s the s t r u c t u r e o f t h e i t e m s i n the i n f o r m a t i o n p a r t , p r e f e r e n c e s be tween them and t h e i r c o n t r i b u t i o n to t he f i n a l r e s u l t . The i n f o r m a t i o n p a r t i s v a r i a b l e . By d e s i g n i n g the l o g i c a l p a r t s u f f i c i e n t l y g e n e r a l , one can use i t even...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the National Aviation University

سال: 2000

ISSN: 2306-1472,1813-1166

DOI: 10.18372/2306-1472.7.11275